The Generalized Minimum Spanning Tree: Polyhedra and Branch-and-Cut
نویسندگان
چکیده
We analyze the facial structure of the polytope associated to the GMSTP with the aim of nding \good" inequalities to strengthen our previous linear formulations. Several families of inequalities which are facet-inducing for the polytope of the GMSTP are investigated. Our proofs of \facetness" for valid inequalities of the GMSTP polytope use tools developped in [3] and also classical results from [4].
منابع مشابه
Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
This article studies the generalized hop-constrained minimum spanning tree problem (GHMSTP) which has applications in backbone network design subject to quality-of-service constraints that restrict the maximum number of intermediate routers along each communication path. Different possibilities to model the GHMSTP as an integer linear program and strengthening valid inequalities are studied. Th...
متن کاملThe generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
This article presents a branch-and-cut algorithm for the Generalized Minimum Spanning Tree Problem (GMSTP). Given an undirected graph whose vertex set is partitioned into clusters, the GMSTP consists of determining a minimum cost tree including exactly one vertex per cluster. Applications of the GMSTP are encountered in telecommunications. An integer linear programming formulation is presented ...
متن کاملAn extension of disjunctive programming and its impact for compact tree formulations
In the 1970’s, Balas [2, 4] introduced the concept of disjunctive programming, which is optimization over unions of polyhedra. One main result of his theory is that, given linear descriptions for each of the polyhedra to be taken in the union, one can easily derive an extended formulation of the convex hull of the union of these polyhedra. In this paper, we give a generalization of this result ...
متن کاملA branch-and-cut algorithm for the minimum branch vertices spanning tree problem
Given a connected undirected graph G = (V;E), the Minimum Branch Vertices Problem (MBVP) asks for a spanning tree of G with the minimum number of vertices having degree greater than two in the tree. These are called branch vertices. This problem, which has an application in the context of optical networks, is known to be NPhard. We model the MBVP as an integer linear program, with undirected va...
متن کاملBranch-and-Cut and GRASP with Hybrid Local Search for the Multi-Level Capacitated Minimum Spanning Tree Problem
We propose efficient algorithms to compute tight lower bounds and high quality upper bounds for the Multi-Level Capacitated Minimum Spanning Tree problem. We first develop a branch-andcut algorithm for the problem. This algorithm is able to solve instances of medium size and to provide tight lower bounds for larger ones. We then use the branch-and-cut within GRASP to evaluate subproblems during...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 3 شماره
صفحات -
تاریخ انتشار 1999